An asymmetric distributed shared memory model for heterogeneous parallel systems
نویسندگان
چکیده
منابع مشابه
Parallel Loop Scheduling Approaches for Distributed and Shared Memory Systems
In this paper, we propose different approaches for the parallel loop scheduling problem on distributed as well as shared memory systems. Specifically, we propose adaptive loop scheduling models in order to achieve load balancing, low runtime scheduling, low synchronization overhead and low communication overhead. Our models are based on an adaptive determination of the chunk size and an exploit...
متن کاملAn OR Parallel Prolog Model for Distributed Memory Systems
This paper shows a multisequential model to exploit OR parallelism on distributed memory systems. It presents an implementation of the incremental copy mechanism oriented to distributed systems and a novel distributed scheduler is also proposed. WAM modifications to support the proposed model are very simple. The system has been implemented on a 16 processor multicomputer based on transputers. ...
متن کاملShared State for Heterogeneous Distributed Systems
InterWeave is a distributed middleware system that supports the sharing of strongly typed, pointerrich data structures across a wide variety of hardware architectures, operating systems, and programming languages. As a complement to RPC/RMI, InterWeave facilitates the rapid development of maintainable code by allowing processes to access shared data using ordinary reads and writes. To maximize ...
متن کاملDistributed Parallel Volume Rendering on Shared Memory Systems
This paper reports on the remote use of MIMD parallel machines for compute-intensive visualisation tasks. As an alternative to dedicated rendering hardware, a system using conventional desktop machines connected to a visualisation server permits sharing of the resource between several users, and/or sites. The design of a parallel rendering system should consider not only how to achieve efficien...
متن کاملAdaptively Scheduling Parallel Loops in Distributed Shared-Memory Systems
Using runtime information of load distributions and processor affinity, we propose an adaptive scheduling algorithm and its variations from different control mechanisms. The proposed algorithm applies different degrees of aggressiveness to adjust loop scheduling granularities, aiming at improving the execution performance of parallel loops by making scheduling decisions that match the real work...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ACM SIGARCH Computer Architecture News
سال: 2010
ISSN: 0163-5964
DOI: 10.1145/1735970.1736059